Finite Field Models in Arithmetic Combinatorics

Finite field models in arithmetic combinatorics - ten years on

On Growth in an Abstract Plane

There is a parallelism between growth in arithmetic combinatorics and growth in a geometric context. While, over R or C, geometric statements on growth often have geometric proofs, what little is known over finite fields rests on arithmetic proofs. We discuss strategies for geometric proofs of growth over finite fields, and show that growth can be defined and proven in an abstract projective pl...

Lecture Notes 1 for 254a

The aim of this course is to tour the highlights of arithmetic combinatorics the combinatorial estimates relating to the sums, differences, and products of finite sets, or to related objects such as arithmetic progressions. The material here is of course mostly combinatorial, but we will also exploit the Fourier transform at times. We will also discuss the recent applications of this theory to ...

Arithmetic Progressions in Sets with Small Sumsets

We present an elementary proof that if A is a finite set of numbers, and the sumset A+G A is small, |A+G A| ≤ c|A|, along a dense graph G, then A contains k-term arithmetic progressions.

The interplay of Invariant Theory with Multiplicative Ideal Theory and with Arithmetic Combinatorics

This paper surveys and develops links between polynomial invariants of finite groups, factorization theory of Krull domains, and product-one sequences over finite groups. The goal is to gain a better understanding of the multiplicative ideal theory of invariant rings, and connections between the Noether number and the Davenport constants of finite groups.